On the Range Maximum-Sum Segment Query Problem
نویسندگان
چکیده
We are given a sequence A of n real numbers which is to be preprocessed. In the Range Maximum-Sum Segment Query (RMSQ) problem, a query is comprised of two intervals [i, j] and [k, l] and our goal is to return the maximum-sum segment of A whose starting index lies in [i, j] and ending index lies in [k, l]. We propose the first known algorithm for this problem in O(n) preprocessing time and O(1) time per query under the unit-cost RAM model.
منابع مشابه
An Optimal Algorithm for the Range Maximum-Sum Segment Query Problem
We are given a sequence A of n real numbers which is to be preprocessed. In the Range Maximum-Sum Segment Query (RMSQ) problem, a query is comprised of two intervals [i, j] and [k, l] and our goal is to return the maximum-sum segment of A where the staring index of the segment lies in [i, j] and the ending index lies in [k, l]. We provide the ̄rst known optimal algorithm with O(n) preprocessing...
متن کاملFr{'e}chet and Hausdorff Queries on $x$-Monotone Trajectories
vspace{0.2cm}In this paper, we design a data structure for the following problem. Let $pi$ be an $x$-monotone trajectory with $n$ vertices in the plane and $epsilon >0$. We show how to preprocess $pi$ and $epsilon$ into a data structure such that for any horizontal query segment $Q$ in the plane, one can quickly determine the minimal continuous fraction of $pi$ whose Fr{'e}chet and Hausdo...
متن کاملGroup Nearest Neighbor Queries in the L 1 Plane
Let P be a set of n points in the plane. The k-nearest neighbor (k-NN) query problem is to preprocess P into a data structure that quickly reports k closest points in P for a query point q. This paper addresses a generalization of the k-NN query problem to a query set Q of points, namely, the group nearest neighbor problem, in the L1 plane. More precisely, a query is assigned with a set Q of at...
متن کاملInverse Maximum Dynamic Flow Problem under the Sum-Type Weighted Hamming Distance
Inverse maximum flow (IMDF), is among the most important problems in the field ofdynamic network flow, which has been considered the Euclidean norms measure in previousresearches. However, recent studies have mainly focused on the inverse problems under theHamming distance measure due to their practical and important applications. In this paper,we studies a general approach for handling the inv...
متن کاملVehicle Routing Problem in Competitive Environment: Two-Person Nonzero Sum Game Approach
Vehicle routing problem is one of the most important issues in transportation. Among VRP problems, the competitive VRP is more important because there is a tough competition between distributors and retailers. In this study we introduced new method for VRP in competitive environment. In these methods Two-Person Nonzero Sum games are defined to choose equilibrium solution. Therefore, revenue giv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 155 شماره
صفحات -
تاریخ انتشار 2004